Fast recovery and approximation of hidden Cauchy structure
نویسندگان
چکیده
We derive an algorithm of optimal complexity which determines whether a given matrix is a Cauchy matrix, and which exactly recovers the Cauchy points defining a Cauchy matrix from the matrix entries. Moreover, we study how to approximate a given matrix by a Cauchy matrix with a particular focus on the recovery of Cauchy points from noisy data. We derive an approximation algorithm of optimal complexity for this task, and prove approximation bounds. Numerical examples illustrate our theoretical results.
منابع مشابه
TR-2013010: Transformations of Matrix Structures Work Again II
Matrices with the structures of Toeplitz, Hankel, Vandermonde and Cauchy types are omnipresent in modern computations in Sciences, Engineering and Signal and Image Processing. The four matrix classes have distinct features, but in [P90] we showed that Vandermonde and Hankel multipliers transform all these structures into each other and proposed to employ this property in order to extend any suc...
متن کاملTransformations of Matrix Structures Work Again II ∗
Matrices with the structures of Toeplitz, Hankel, Vandermonde and Cauchy types are omnipresent in modern computations in Sciences, Engineering and Signal and Image Processing. The four matrix classes have distinct features, but in [P90] we showed that Vandermonde and Hankel multipliers transform all these structures into each other and proposed to employ this property in order to extend any suc...
متن کاملThe Cauchy-riemann Equations: Discretization by Nite Elements, Fast Solution, and a Posteriori Error Estimation the Cauchy-riemann Equations: Discretization by Nite Elements, Fast Solution, and a Posteriori Error Estimation
In this paper we will concentrate on the numerical solution of the Cauchy-Riemann equations. First we show that these equations bring together the nite element discretizations for the Laplace equation by standard nite elements on the one hand, and by mixed nite element methods on the other. As a consequence, methods for a posteriori error estimation for both nite element methods can derive thei...
متن کاملتنظیم بهینه و همزمان ساختار و پارامترهای شبکه عصبی با استفاده از الگوریتم آمیختار مبتنی بر جستجوی گرانشی برای کاربردهای دستهبندی و تقریب توابع
Determining the optimum number of nodes, number of hidden layers, and synaptic connection weights in an artificial neural network (ANN) plays an important role in the performance of this soft computing model. Several methods have been proposed for weights update (training) and structure selection of the ANNs. For example, the error back-propagation (EBP) is a traditional method for weights...
متن کاملTR-2013011: Fast Approximation Algorithms for Cauchy Matrices, Polynomials and Rational Functions
The papers [MRT05], [CGS07], [XXG12], and [XXCBa] have combined the advanced FMM techniques with transformations of matrix structures (traced back to [P90]) in order to devise numerically stable algorithms that approximate the solutions of Toeplitz, Hankel, Toeplitzlike, and Hankel-like linear systems of equations in nearly linear arithmetic time, versus classical cubic time and quadratic time ...
متن کامل